Predicting non-square 2D dice probabilities
نویسندگان
چکیده
منابع مشابه
Colliding Dice Probabilities
LetK, L be congruent regular polyhedra in R. Let g denote a rigid motion of R, that is, g(x) = Φx+τ where Φ is a 3×3 rotation matrix and τ is a translation 3-vector. The polyhedraK, g(L) are said to touch ifK∩g(L) 6= ∅ but int(K)∩int(g(L)) = ∅. Alternatively, we may think of ΦL moving toward K in the direction τ , stopping precisely when the two polyhedra collide. Let us sample the space SO3 of...
متن کاملBalanced Non-Transitive Dice
We study triples of labeled dice in which the relation “is a better die than” is non-transitive. Focusing on such triples with an additional symmetry we call “balanced,” we prove that such triples of n-sided dice exist for all n ≥ 3. We then examine the sums of the labels of such dice, and use these results to construct an O(n) algorithm for verifying whether or not a triple of n-sided dice is ...
متن کاملComputing and approximating multivariate chi-square probabilities
We consider computational methods for evaluating and approximating multivariate chisquare probabilities in cases where the pertaining correlation matrix or blocks thereof have a low-factorial representation. To this end, techniques from matrix factorization and probability theory are applied. We outline a variety of statistical applications of multivariate chi-square distributions and provide a...
متن کاملStrongly connectable digraphs and non-transitive dice
We show that a directed graph extends to a strongly connected digraph on the same vertex set if and only if it has no complete directed cut. We bound the number of edges needed for such an extension, and we apply the characterization to a problem on non-transitive dice.
متن کاملOptimal gossiping in square 2D meshes
Gossiping is the communication problem in which each node has a unique message to be transmitted to every other node. The nodes exchange their message by packets. A solution to the problem is judged by how many rounds of packet sending it requires. In this paper, we consider the version of the problem in which small-size packets each carrying exactly one message are used. The nodes of the targe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Physics
سال: 2014
ISSN: 0143-0807,1361-6404
DOI: 10.1088/0143-0807/35/4/045028